Output maximization container loading problem with time availability constraints
نویسندگان
چکیده
منابع مشابه
Container loading with multi-drop constraints
In this thesis, we develop an algorithm for the container loading problem (CLP) with multi-drop constraints. The CLP is the problem of loading the maximal value of a set of boxes into a container, while ensuring that the boxes neither overlap each other nor the container walls. By adding multi-drop constraints it is further demanded, that the relevant boxes must be available, without rearrangin...
متن کاملMathematical models for Multi Container Loading Problems with practical constraints
We address the multi container loading problem of a company that has to serve its customers by first putting the products on pallets and then loading the pallets into trucks. We approach the problem by developing and solving integer linear models. To be useful in practice, our models consider three types of constraints: geometric constraints, so that pallets lie completely inside the trucks and...
متن کاملAlgorithms for the Container Loading Problem
In this paper we consider the three-dimensional problem of optimal packing of a container with rectangular pieces. We propose an approximation algorithm based on the "forward state strategy" of dynamic programming. A suitable description of packings is developed for the implementation of the approximation algorithm, and some computational experience is reported. Zusammenfassung: Zur nn aherungs...
متن کاملHeuristics for the container loading problem
The knapsack container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized. A new heuristic based on the wall-building approach is proposed, which decomposes the problem into a number of layers which again are split into a number of strips. The packing of a strip may be for...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Perspectives
سال: 2019
ISSN: 2214-7160
DOI: 10.1016/j.orp.2019.100126